Partitions approximated by finite cosine-series
نویسندگان
چکیده
منابع مشابه
Functional hand proportion is approximated by the Fibonacci series.
The debatable relationship of functional human hand proportion with the Fibonacci series has remained an obscure scientific enigma short of clinical interest. The main difficulty of proving such a relationship lies in defining what should constitute true functional proportion. In this study, we re-evaluate this unique relationship using hand flexion creases as anatomical surrogates for the...
متن کاملOperating Points in Infinite Nonlinear Networks Approximated by Finite Networks
Given a nonlinear infinite resistive network, an operating point can be determined by approximating the network by finite networks obtained by shorting together various infinite sets of nodes, and then taking a limit of the nodal potential functions of the finite networks. Initially, by taking a completion of the node set of the infinite network under a metric given by the resistances, limit po...
متن کاملXo-CATEGORICAL STRUCTURES SMOOTHLY APPROXIMATED BY FINITE SUBSTRUCTURES
A classification is given of primitive K0-categorical structures which are smoothly approximated by a chain of finite homogeneous substructures. The proof uses the classification of finite simple groups and some representation theory. The main theorems give information about a class of structures more general than the X0-categorical, co-stable structures examined by Cherlin, Harrington, and Lac...
متن کاملFinite Metric Spaces and Partitions
For example, IR with the regular Euclidean distance is a metric space. It is usually of interest to consider the finite case, where X is an n-point set. Then, the function d can be specified by ( n 2 ) real numbers. Alternatively, one can think about (X,d) is a weighted complete graph, where we specify positive weights on the edges, and the resulting weights on the edges comply with the triangl...
متن کاملCompatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets. The problem is generalized to finding compatible triangulations for more than two point sets and we show that such triangulations can be constructed with only a l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1992
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1992-1122065-8